Monadic Methods
نویسندگان
چکیده
Object-oriented frameworks are often based on `skeleton' methods that determine the overall control ow and that carry around `contextual information'. Changing the signature of a skeleton method often induces a combinatorial explosion of changes to other methods spread over the di erent classes of the framework. Our work materialises these skeleton methods as that carry around monadic information. The nature of the information and the way it ows through the code is determined by a so called monad. We investigate monadic methods, and explain how the monadic style limits the propagation of changes to skeleton methods.
منابع مشابه
On Second-Order Monadic Monoidal and Groupoidal Quantifiers
We study logics defined in terms of second-order monadic monoidal and groupoidal quantifiers. These are generalized quantifiers defined by monoid and groupoid word-problems, equivalently, by regular and context-free languages. We give a computational classification of the expressive power of these logics over strings with varying built-in predicates. In particular, we show that ATIME(n) can be ...
متن کاملAlgebraic Methods of Automated Reasoning in Monadic Logic
The purpose of this paper is to explain how the theory of Gröbner bases can be used for automated proving in Monadic Logic. The paper is organized as follows: in Section 1 we recall the syntax and semantics of Monadic Logic, and we describe the aim of this paper: the resolution by an algebraic algorithm of the deduction problem in Monadic Logic. Successively, we reduce the deduction problem in ...
متن کاملRegular Cost Functions, Part I: Logic and Algebra over Words
The theory of regular cost functions is a quantitative extension to the classical notion of regularity. A cost function associates to each input a non-negative integer value (or infinity), as opposed to languages which only associate to each input the two values “inside” and “outside”. This theory is a continuation of the works on distance automata and similar models. These models of automata h...
متن کاملThe monadic second-order logic of graphs XVI : Canonical graph decompositions
This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more general result covering canonical graph decompositions like the modular decomposition and the Tutte decomposition of 2-connected graphs into 3-connected components. As an application, we prove that the set of graphs hav...
متن کاملAbstraction and Performance from Explicit Monadic Reflection
Most of the existing literature about monadic programming focuses on theory but does not address issues of software engineering. Using monadic parsing as a running example, we demonstrate monadic programs written in a typical style, recognize how they violate abstraction boundaries, and recover clean abstraction crossings through monadic reflection. Once monadic reflection is made explicit, it ...
متن کامل